منابع مشابه
An Efficient Ant Colony Instance Selection Algorithm for KNN Classification
The extraordinary progress in the computer sciences field has made Nearest Neighbor techniques, once considered impractical from a standpoint of computation (Dasarathy et al., 2003), became feasible for realworld applications. In order to build an efficient nearest neighbor classifier two principal objectives have to be reached: 1) achieve a high accuracy rate; and 2) minimize the set of instan...
متن کاملEfficient Algorithm to Monitor Continuous kNN Queries
Continuous monitoring of k nearest neighbor (kNN) queries has attracted significant research attention in the past few years. A safe region is an area such that as long as a kNN query remains in it, the set of its k nearest neighbors does not change. Hence, the server does not need to update the query results unless the query moves out of its safe region. Previous work uses time-parameterized k...
متن کاملA Novel and Efficient KNN using Modified Apriori Algorithm
In the field of data mining, classification and association set rules are two of very important techniques to find out new patterns. K-nearest neighbor and apriori algorithm are most usable methods of classification and association set rules respectively. However, individually they face few challenges, such as, time utilization and inefficiency for very large databases. The current paper attemp...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملLazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In the past few years, continuous monitoring of spatial queries has received significant attention from the database research community. In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive towards objects and queries movement. For example, the results of a query are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartB
سال: 2004
ISSN: 1598-284X
DOI: 10.3745/kipstb.2004.11b.7.849